The Extended Analog Computer and Turing machine Monika

نویسنده

  • Monika Piekarz
چکیده

In this paper we compare computational power of two models of analog and classical computers. As a model of analog computer we use the model proposed by Rubel in 1993 called the Extended Analog Computer (EAC) while as a model of classical computer, the Turing machines. Showing that the Extended Analog Computer can robustly generate result of any Turing machine we use the method of simulation proposed by D.S. Graça, M.L. Campagnolo and J. Buescu [1] in 2005.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Extended Analog Computer and Turing machine Monika Piekarz

In this paper we compare computational power of two models of analog and classical computers. As a model of analog computer we use the model proposed by Rubel in 1993 called the Extended Analog Computer (EAC) while as a model of classical computer, the Turing machines. Showing that the Extended Analog Computer can robustly generate result of any Turing machine we use the method of simulation pr...

متن کامل

The Extended Analog Computer and Turing machine

In this paper we compare computational power of two models of analog and classical computers. As a model of analog computer we use the model proposed by Rubel in 1993 called the Extended Analog Computer (EAC) while as a model of classical computer, the Turing machines. Showing that the Extended Analog Computer can robustly generate result of any Turing machine we use the method of simulation pr...

متن کامل

Annales UMCS Informatica AI 7 ( 2007 ) 37 - 47 Annales UMCS Informatica

In this paper we compare computational power of two models of analog and classical computers. As a model of analog computer we use the model proposed by Rubel in 1993 called the Extended Analog Computer (EAC) while as a model of classical computer, the Turing machines. Showing that the Extended Analog Computer can robustly generate result of any Turing machine we use the method of simulation pr...

متن کامل

Some improvements in fuzzy turing machines

In this paper, we improve some previous definitions of fuzzy-type Turing machines to obtain degrees of accepting and rejecting in a computational manner. We apply a BFS-based search method and some level’s upper bounds to propose a computational process in calculating degrees of accepting and rejecting. Next, we introduce the class of Extended Fuzzy Turing Machines equipped with indeterminacy s...

متن کامل

The Extended Analog Computer and Functions Computable in a Digital Sense

Analog computation as the study of computation capabilities of continuoustime dynamical systems described by means of differential equations got a resurgence of interest in the last decade after a new glimpse of Cris Moore in [A] on the work of Shanon ([21]), Marion B. Pour-El ([15]), and Lee A. Rubel ([20]). Papers such as [9], [7] and [8], but others not cited by Monika Piekarz, succeeded in ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2018